package hiho.ku._1051;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		for (int i = 0; i < t; i++)
			run(in);
	}
	
	private static void run(Scanner in) {
		int n = in.nextInt();
		int m = in.nextInt();
		int[] vs = new int[n + 1];
		int last = 0;
		for (int i = 0; i < n; i++) {
			int v = in.nextInt();
			vs[i] = v - last - 1;
			last = v;
		}
		vs[n] = 100 - last;
		
		if (m >= n) {
			System.out.println(100);
			return;
		}
		int ans = 0;
		for (int i = 0; i <= n - m; i++) {
			int sum = 0;
			for (int j = i; j <= i + m; j++)
				sum += vs[j];
			ans = Math.max(ans, sum);
		}
		System.out.println(ans + m);
	}
	
}
